Screening and selection procedures with control variates and correlation induction techniques

We consider the problem of identifying the simulated system with the best expected performance measure when the number of alternatives is finite and small (often < 500). Recently, more research efforts in the simulation community have been directed to develop ranking and selection (R&S) procedures capable of exploiting variance reduction techniques (especially the control variates). In this article, we propose new R&S procedures that can jointly use control variates and correlation induction techniques (including antithetic variates and Latin hypercube sampling). Empirical results and a realistic illustration show that the proposed procedures outperform the conventional procedures using sample means or control variates alone. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

逆边界无网格法声源识别的理论与实验

针对逆向求解声源识别中的声辐射传输建模问题,采用无网格法将Kirchhoff- Helmholtz边界积分方程离散为受边界条件约束的有限维线性方程组,通过分块矩阵法对该约束方程组进行求解,得到了离散后声辐射传输模型的数值表达式.在此基础上,进一步研究了逆向求解声源识别问题的基本原理及其不适定性.为克服其不适定性,采用Tikhonov正则化和L曲线正则化参数选取方法,从而确立了有效的逆向求解方法.此外,还进行了扬声器阵列声源识别实验,实验结果验证了逆边界无网格声源识别理论和方法的可行性及可靠性.     

箱式屏蔽效能测试方法及影响因素分析

为测试强电磁场作用下材料的屏蔽效能,基于屏蔽材料的屏蔽原理,提出一种在GTEM室内置屏蔽箱测试材料屏蔽效能的新方法,构建实验平台,仿真分析屏蔽箱窗口尺寸及测试探头位置对测试结果的影响．实验结果表明：测试窗口大小和测试位置对测试材料的屏蔽效能有影响．其主要影响因素是屏蔽效能的测试频率下限,并确定了0．6m×0．6m窗口的测试频率下限为55MHz,0．3m×0．3m测试窗口的测试频率下限为250MHz．     

基于双向启发式属性约简的战术决策建模研究

从预警机指挥引导的多机协同空战原则分析出发,针对超视距协同空战决策过程中的不确定性和不完备性问题,提出了一种不完备信息系统中的基于双向启发式属性约简的战术粗决策建模方法。首先考虑粗糙集决策过程中条件属性发生缺失或不确定的情况,根据扩展不完备信息概念建立了不完备决策信息系统的最优完备选择;其次基于分辨矩阵的属性约简算法,以属性频度的大小作为启发信息进行决策信息系统约简的双向选择,得出决策信息系统的最佳约简集合;然后依据使决策最有可能发生的原则,给出决策信息系统的最优选择,以该最优选择为代表提取出决策规则;最后根据软、硬杀伤结合使用的CGF实体超视距协同空战作战想定,建立了CGF实体综合战术决策模型,并通过作战决策实例对该方法的正确性和有效性进行了验证。结果表明：该方法能在作战态势信息不完备的情况下正确给出CGF实体综合战术行为。     

水下潜器自导搜索策略仿真平台设计与应用

根据研究实际需求,本文基于作战能力评估理论对水下潜器自导搜索策略仿真平台进行了开发设计,并结合建立的多指标评估体系和相应的评估方法,借助均匀设计法,将其成功应用于水下潜器自导搜索策略的设计优化中。文中首先分析了仿真平台的系统需求,进而确定了其总体构架,并针对自导搜索策略研究的特点确定了相应的人机交互界面。最后给出了进行自导搜索策略仿真优化的基本思路和方法,并通过水下潜器最优自导搜索策略方案仿真研究的实例表明,本文设计的仿真平台和研究方法不仅完全能够满足水下潜器的自导搜索策略仿真研究需求,还能有效节省科研成本,具有重要的工程应用价值。     

高超声速滑翔飞行器倾斜转弯分析及控制系统设计

倾斜转弯技术是高超声速滑翔飞行器控制的一个重要发展方向.针对高超声速滑翔飞行器倾斜转弯技术开展研究.以平衡滑翔弹道为参考弹道,分析了转弯半径、下降高度、倾侧角等参数之间的关系,提出在设计高超声速滑翔飞行器制导控制指令时,应综合考虑不同高度速度下的控制能力约束.根据奇异摄动理论将动力学系统的受控状态变量分为快变量和慢变量两部分,运用轨迹线性化方法设计了控制系统.仿真结果表明,设计的控制器具有良好的控制性能,但随着高度的增加,控制指令应结合实际控制能力,以完成对飞行器的姿态控制.     

日本新型06式枪榴弹解析

日本06式枪榴弹采用新型材料，大幅降低了弹的质量和体积，提高了杀伤效能；采取分离一飞行方式，大大减小了后坐能量，增大了射程；运用弹头捕阱系统，减少了烟尘、碎屑等污染物，保证枪榴弹实弹发射时的安全。其设计思想和战术性能在步兵轻武器领域达到世界领先水平。     

基于数据压缩的LSP参数高效量化算法

文中为解决超长帧编码系统中联合帧数过多导致LSP参数量化性能下降这个问题,将多项式拟合引入超长帧编码系统中,利用多项式拟合压缩LSP参数矩阵,以降低量化时实际联合的帧数。再用分裂矩阵量化器进行量化。仿真结果表明,在120 bps的参数量化速率下,此算法的量化性能优于矩阵量化算法(MQ),平均谱失真比MQ算法降低了0.0719 dB,平均分段信噪比提高了0.1971 dB。     

A partial characterization of the optimal ordering/rationing policy for a periodic review system with two demand classes and backordering

We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010